Bounds for Validation
نویسنده
چکیده
In this paper we derive the bounds for Validation (known also as Hold-Out Estimate and Train-and-Test Method). We present the best possible bound in the case of 0-1 valued loss function. We also provide the tables where the least sample size is calculated that is necessary for obtaining the bound for a given estimation rate and reliability of estimation. For an arbitrary bounded loss function we present the optimal bound approximation with any given accuracy.
منابع مشابه
A stochastic version analysis of an M/G/1 retrial queue with Bernoulli schedule
In this work, we derive insensitive bounds for various performance measures of a single-server retrial queue with generally distributed inter-retrial times and Bernoulli schedule, under the special assumption that only the customer at the head of the orbit queue (i.e., a FCFS discipline governing the flow from the orbit to the server) is allowed to occupy the server. The method...
متن کاملImproved Uniform Test Error Bounds
We derive distribution free uniform test error bounds that improve on VC type bounds for validation We show how to use knowledge of test inputs to improve the bounds The bounds are sharp but they require intense computation We introduce a method to trade sharpness for speed of computation Also we compute the bounds for several test cases Key wordsmachine learning learning theory generalization ...
متن کاملNear-Optimal Bounds for Cross-Validation via Loss Stability
Multi-fold cross-validation is an established practice to estimate the error rate of a learning algorithm. Quantifying the variance reduction gains due to cross-validation has been challenging due to the inherent correlations introduced by the folds. In this work we introduce a new and weak measure called loss stability and relate the cross-validation performance to this measure; we also establ...
متن کاملStability of cross-validation and minmax-optimal number of folds
In this paper, we analyze the properties of cross-validation from the perspective of the stability, that is, the difference between the training error and the error of the selected model applied to any other finite sample. In both the i.i.d. and non-i.i.d. cases, we derive the upper bounds of the one-round and average test error, referred to as the one-round/convoluted Rademacher-bounds, to qua...
متن کاملStrong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملImpacts of Premium Bounds on the Operation of Put Option and Day-ahead Electricity Markets
In this paper, the impacts of premium bounds of put option contracts on the operation of put option and day-ahead electricity markets are studied. To this end, first a comprehensive equilibrium model for a joint put option and day-ahead markets is presented. Interaction between put option and day-ahead markets, uncertainty in fuel price, impact of premium bounds, and elasticity of con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 70 شماره
صفحات -
تاریخ انتشار 2006